Componentwise enclosure for solutions of least squares problems and underdetermined systems
نویسندگان
چکیده
منابع مشابه
Fast Enclosure for Solutions of Generalized Least Squares Problems∗
Fast algorithms for enclosing solutions of generalized least squares problems are proposed. To develop these algorithms, theories for obtaining error bounds on numerical solutions are established. The error bounds obtained by these algorithms are “verified” in the sense that all the possible rounding errors have been taken into account. A technique for obtaining smaller error bounds is introduc...
متن کاملVerified Bounds for Least Squares Problems and Underdetermined Linear Systems
New algorithms are presented for computing verified error bounds for least squares problems and underdetermined linear systems. In contrast to previous approaches the new methods do not rely on normal equations and are applicable to sparse matrices. Computational results demonstrate that the new methods are faster than existing ones.
متن کاملComponentwise Least Squares Support Vector Machines
This chapter describes componentwise Least Squares Support Vector Machines (LS-SVMs) for the estimation of additive models consisting of a sum of nonlinear components. The primal-dual derivations characterizing LS-SVMs for the estimation of the additive model result in a single set of linear equations with size growing in the number of data-points. The derivation is elaborated for the classific...
متن کاملOn mixed and componentwise condition numbers for Moore-Penrose inverse and linear least squares problems
Classical condition numbers are normwise: they measure the size of both input perturbations and output errors using some norms. To take into account the relative of each data component, and, in particular, a possible data sparseness, componentwise condition numbers have been increasingly considered. These are mostly of two kinds: mixed and componentwise. In this paper, we give explicit expressi...
متن کاملIll-conditionedness Needs Not Be Componentwise near to Ill-posedness for Least Squares Problems
The condition number of a problem measures the sensitivity of the answer to small changes in the input, where “small” refers to some distance measure. A problem is called illconditioned if the condition number is large, and it is called ill-posed if the condition number is infinity. It is known that for many problems the (normwise) distance to the nearest ill-posed problem is proportional to th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2014
ISSN: 0024-3795
DOI: 10.1016/j.laa.2013.11.044